Generalized acceptance, succinctness and supernondeterministic finite automata
نویسندگان
چکیده
منابع مشابه
Finite Automata with Generalized Acceptance Criteria
We examine the power of nondeterministic finite automata with acceptance of an input word defined by a leaf language, i. e., a condition on the sequence of leaves in the automaton’s computation tree. We study leaf languages either taken from one of the classes of the Chomsky hierarchy, or taken from a timeor space-bounded complexity class. We contrast the obtained results with those known for l...
متن کاملSuccinctness of two-way probabilistic and quantum finite automata
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau...
متن کاملExpressive Equivalence and Succinctness of Parametrized Automata with Respect to Finite Memory Automata
We compare parametrized automata, a class of automata recently introduced by the authors, against finite memory automata with non-deterministic assignment, an existing class of automata used to model services. We prove that both classes have the same expressive power, while parametrized automata can be exponentially succinct in some cases. We then prove that deciding simulation preorder for par...
متن کاملOn the (In)Succinctness of Muller Automata
There are several types of finite automata on infinite words, differing in their acceptance conditions. As each type has its own advantages, there is an extensive research on the size blowup involved in translating one automaton type to another. Of special interest is the Muller type, providing the most detailed acceptance condition. It turns out that there is inconsistency and incompleteness i...
متن کاملState succinctness of two-way finite automata with quantum and classical states
Two-way quantum automata with quantum and classical states (2QCFA) were introduced by Ambainis and Watrous in 2002. In this paper we study state succinctness of 2QCFA. For any m ∈ Z and any < 1/2, we show that: 1. there is a promise problem A(m) which can be solved by a 2QCFA with one-sided error in a polynomial expected running time with a constant number (that depends neither on m nor on ε) o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2004
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2003.10.013